Reasoning About Embedded Dependencies Using Inclusion Dependencies
نویسنده
چکیده
The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions.
منابع مشابه
EPiC Series in Computing
Inclusion dependencies are one of the most important database constraints. In isolation their finite and unrestricted implication problems coincide, are finitely axiomatizable, PSPACE-complete, and fixed-parameter tractable in their arity. In contrast, finite and unrestricted implication problems for the combined class of functional and inclusion dependencies deviate from one another and are ea...
متن کاملA Finite Axiomatization of Conditional Independence and Inclusion Dependencies
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.
متن کاملInference Rules for Nested Functional Dependencies
Functional dependencies add semantics to a database schema, and are useful for studying various problems, such as database design, query optimization and how dependencies are carried into a view. In the context of a nested relational model, these dependencies can be extended by using path expressions instead of attribute names, resulting in a class of dependencies that we call nested functional...
متن کاملA Methodology for Unified Assessment of Physical and Geographical Dependencies of Wide Area Measurement Systems in Smart Grids
Wide Area Measurement Systems (WAMS) enable real time monitoring and control of smart grids by combining digital measurement devices, communication and control systems. As WAMS consist of various infrastructures, they imply complex dependencies among their underlying systems and components of different types, such as cyber, physical and geographical dependencies. Although several works exist in...
متن کاملAn Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies
A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is introduced and based on it a method for efficiently reasoning about fuzzy functional dependencies over domains with similarity relations. The complexity of the algorithm is the same as that of equivalent algorithms for crisp functional dependencies that appear in the literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015